Derangements on the n-cube

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Derangements on the n-cube

Chen, W.Y.C. and R.P. Stanley, Derangements on the n-cube, Discrete Mathematics 115 (1993) 65-15. Let Q. be the n-dimensional cube represented by a graph whose vertices are sequences of O’s and l’s of length n, where two vertices are adjacent if and only if they differ only at one position. A k-dimensional subcube or a k-face of Q. is a subgraph of Q. spanned by all the vertices u1 u2 u, with c...

متن کامل

Finite Groups of Derangements on the n-Cube II

Given k ∈ N and a finite group G, it is shown that G is isomorphic to a subgroup of the group of symmetries of some n-cube in such a way that G acts freely on the set of k-faces, if and only if, gcd(k, |G|) = 2s for some non-negative integer s. The proof of this result is existential but does give some ideas on what n could be.

متن کامل

Finite Groups of Derangements on the n-Cube

W. Y. C. Chen and R. P. Stanley have characterized the symmetries of the n-cube that act as derangements on the set of k-faces. In this paper we aim to use their result to characterize those finite subgroups of symmetries whose non-trivial members are derangements of the set of k-faces.

متن کامل

Stratiied Random Walks on the N-cube

In this paper we present a method for analyzing a general class of ramdom walks on the n cube and certain subgraphs of it These walks all have the property that the transition probabilities depend only on the level of the point the walk is at For these walks we derive sharp bounds on their mixing rates i e the number of steps required to guarantee that the resulting distribution is close to the...

متن کامل

Stratified random walks on the n-cube

In this paper we present a method for analyzing a general class of random Ž . walks on the n-cube and certain subgraphs of it . These walks all have the property that the transition probabilities depend only on the level of the point at which the walk is. For these walks, we derive sharp bounds on their mixing rates, i.e., the number of steps required to Ž . guarantee that the resulting distrib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1993

ISSN: 0012-365X

DOI: 10.1016/0012-365x(93)90479-d